How not to state T-sentences

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

I-Languages and T-sentences

This paper is about the relevance of Liar Paradoxes for truth-theoretic accounts of linguistic meaning. In " Framing Event Variables, " I develop an independent objection to such accounts. But in both essays, the first numbered sentence is the one displayed below. (1) The first numbered sentence in " Framing Event Variables " is false. Let 'Lari' be a name for the first numbered sentence in tha...

متن کامل

T-Equivalences for positive Sentences

Answering a question formulated by Halbach (2009), I show that a disquotational truth theory, which takes as axioms all positive substitutions of the sentential T-schema, together with all instances of induction in the language with the truth predicate, is conservative over its syntactical base. §

متن کامل

How to Represent Opaque Sentences in First Order Logic

T h i s paper presents a m e t h o d for a p p l y i n g s t a n d a r d i n fe renc ing mechan isms to a b roader class of sentences t h a n t h a t wh i ch was possi b le before. T h e logic of proposition surrogates al lows rep resen ta t ion of and reason ing w i t h a class of sentences ( the so ca l led opaque sentences) t h a t pose specia l d i f f icu l t ies fo r s tan d a r d logics....

متن کامل

How (Not) to Palatini

We revisit the problem of defining non-minimal gravity in the first order formalism. Specializing to scalar-tensor theories, which may be disguised as ‘higher-derivative’ models with the gravitational Lagrangians that depend only on the Ricci scalar, we show how to recast these theories as Palatini-like gravities. The correct formulation utilizes the Lagrange multiplier method, which preserves ...

متن کامل

How Not To Do

We give some dos and don'ts for those analysing algorithms experimentally. We illustrate these with many examples from our own research on the study of algorithms for NP-complete problems such as satis ability and constraint satisfaction. Where we have not followed these maxims, we have su ered as a result.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Analysis

سال: 2006

ISSN: 0003-2638,1467-8284

DOI: 10.1111/j.1467-8284.2006.00629.x